منابع مشابه
Constructing Recursions by Similarity
A formal specification can describe software models which are difficult to program. Transformational methods based on fold/unfold strategies have been proposed to palliate this problem. The objective of applying transformations is to filter out a new version of the specification where recursion may be introduced by a folding step. Among many problems, the “eureka” about when and how to define a...
متن کاملMaking Recursions Manipulable by Constructing Medio-types
A catamorphism, generic version of our familiar foldr on lists, is quite a simple recursive scheme associated with data type de nitions. It plays a very important role in program calculation, since for it there exists a general transformation rule known as Promotion Theorem. However, its structure is so tight that many recursions cannot be speci ed by catamorphisms because of their irregular re...
متن کاملSelf-Constructing Clusters Based on Similarity Relation
Many techniques for cluster analysis have been proposed for the last 40 years. It seems that the following three methods have been frequently appearing in the practical applications. The first is a hierarchical method, which represents the clustering process by a dendrogram (Lance, et al.,1967). This method has been most frequently used still now for intuitively understandable. The second one i...
متن کاملFractals, recursions, divisibility
The self similar (fractal) structure of the Pascal triangle of binomial coefficients modulo some fixed prime has been known for some time and explored in detail. It turns out that such a fractal structure is the common property arithmetical functions of two variables possessing a more general recursive relation (R) f(i,j) = af(i-l,j) + bf(i 1,j-1) where a and b are fixed integers. 'When a, b ar...
متن کاملPseudorandom recursions II
We present our earlier results (not included in Hars and Petruska due to space and time limitations), as well as some updated versions of those, and a few more recent pseudorandom number generator designs. These tell a systems designer which computer word lengths are suitable for certain high-quality pseudorandom number generators, and which constructions of a large family of designs provide lo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Brazilian Computer Society
سال: 2003
ISSN: 0104-6500
DOI: 10.1590/s0104-65002003000200003